Remarks on Missing Faces and Generalized Lower Bounds on Face Numbers

نویسنده

  • Eran Nevo
چکیده

We consider simplicial polytopes, and more general simplicial complexes, without missing faces above a fixed dimension. Sharp analogues of McMullen’s generalized lower bounds, and of Barnette’s lower bounds, are conjectured for these families of complexes. Some partial results on these conjectures are presented.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Balanced complexes and complexes without large missing faces

The face numbers of simplicial complexes without missing faces of dimension larger than i are studied. It is shown that among all such (d−1)-dimensional complexes with non-vanishing top homology, a certain polytopal sphere has the componentwise minimal f -vector; and moreover, among all such 2-Cohen–Macaulay (2-CM) complexes, the same sphere has the componentwise minimal h-vector. It is also ve...

متن کامل

Some Remarks on Generalized Sequence Space of Bounded Variation of Sequences of Fuzzy Numbers

The idea of difference sequences of real (or complex) numbers was introducedby Ki zmaz cite{Kizmaz}. In this paper, using the difference operator and alacunary sequence, we introduce and examine the class of sequence $bv_{theta}left(  Delta,mathcal{F}right)  .$ We study some of its properties likesolidity, symmetricity, etc.

متن کامل

Some remarks on the arithmetic-geometric index

Using an identity for effective resistances, we find a relationship between the arithmetic-geometric index and the global ciclicity index. Also, with the help of majorization, we find tight upper and lower bounds for the arithmetic-geometric index.

متن کامل

Efficiency Evaluation and Ranking DMUs in the Presence of Interval Data with Stochastic Bounds

On account of the existence of uncertainty, DEA occasionally faces the situation of imprecise data, especially when a set of DMUs include missing data, ordinal data, interval data, stochastic data, or fuzzy data. Therefore, how to evaluate the efficiency of a set of DMUs in interval environments is a problem worth studying. In this paper, we discussed the new method for evaluation and ranking i...

متن کامل

On the Eccentric Connectivity Index of Unicyclic Graphs

In this paper, we obtain the upper and lower bounds on the eccen- tricity connectivity index of unicyclic graphs with perfect matchings. Also we give some lower bounds on the eccentric connectivity index of unicyclic graphs with given matching numbers.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 16  شماره 

صفحات  -

تاریخ انتشار 2009